Hierarchical multilinear models for multiway data

نویسنده

  • Peter D. Hoff
چکیده

Reduced-rank decompositions provide descriptions of the variation among the elements of a matrix or array. In such decompositions, the elements of an array are expressed as products of lowdimensional latent factors. This article presents a model-based version of such a decomposition, extending the scope of reduced rank methods to accommodate a variety of data types such as longitudinal social networks and continuous multivariate data that is cross-classified by categorical variables. The proposed model-based approach is hierarchical, in that the latent factors corresponding to a given dimension of the array are not a priori independent, but exchangeable. Such a hierarchical approach allows more flexibility in the types of patterns that can be represented. Some key words: Bayesian, multiplicative model, PARAFAC, regularization, shrinkage.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tensor Decompositions: A New Concept in Brain Data Analysis?

Matrix factorizations and their extensions to tensor factorizations and decompositions have become prominent techniques for linear and multilinear blind source separation (BSS), especially multiway Independent Component Analysis (ICA), Nonnegative Matrix and Tensor Factorization (NMF/NTF), Smooth Component Analysis (SmoCA) and Sparse Component Analysis (SCA). Moreover, tensor decompositions hav...

متن کامل

Approximation of N-Way Principal Component Analysis for Organ Data

We apply multilinear principal component analysis to dimension reduction and classification of human volumetric organ data, which are expressed as multiway array data. For the decomposition of multiway array data, tensor-based principal component analysis extracts multilinear structure of the data. We numerically clarify that low-pass filtering after the multidimensional discrete cosine transfo...

متن کامل

Bayesian Sparse Tucker Models for Dimension Reduction and Tensor Completion

Tucker decomposition is the cornerstone of modern machine learning on tensorial data analysis, which have attracted considerable attention for multiway feature extraction, compressive sensing, and tensor completion. The most challenging problem is related to determination of model complexity (i.e., multilinear rank), especially when noise and missing data are present. In addition, existing meth...

متن کامل

Shift-invariant multilinear decomposition of neuroimaging data

We present an algorithm for multilinear decomposition that allows for arbitrary shifts along one modality. The method is applied to neural activity arranged in the three modalities space, time, and trial. Thus, the algorithm models neural activity as a linear superposition of components with a fixed time course that may vary across either trials or space in its overall intensity and latency. It...

متن کامل

Estimating Multivariate Latent - Structure Models

A constructive proof of identification of multilinear decompositions of multiway arrays is presented. It can be applied to show identification in a variety of multivariate latent structures. Examples are finite-mixture models and hidden Markov models. The key step to show identification is the joint diagonalization of a set of matrices in the same nonorthogonal basis. An estimator of the latent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computational Statistics & Data Analysis

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2011